Object Recognition Using Locality-Sensitive Hashing of Shape Contexts
نویسندگان
چکیده
At the core of many computer vision algorithms lies the task of finding a correspondence between image features local to a part of an image. Once these features are calculated, matching is commonly performed using a nearest-neighbor algorithm. In this chapter, we focus on the topic of object recognition, and examine how the complexity of a basic feature-matching approach grows with the number of object classes. We use this as motivation for proposing approaches to featurebased object recognition that grow sublinearly with the number of object classes.
منابع مشابه
Learning of Invariant Object Recognition in a Hierarchical Network
In this paper we propose an object recognition system implementing three basic principles: forming of temporal groups of features, learning in a hierarchical structure and using feedback for predicting future input. It gives very good results on public available datasets. Precondition for successful learning is that training images are presented to the system in an appropriate order such that i...
متن کاملApproximate Computation of Object Distances by Locality-Sensitive Hashing
We propose an approximate computation technique for inter-object distances for binary data sets. Our approach is based on the locality sensitive hashing, scales up with the number of objects and is much faster than the “brute-force” computation of these distances.
متن کاملEfficiently Finding Unusual Shapes in Large Image DatabasesF1F
Among the visual features of multimedia content, shape is of particular interest because humans can often recognize objects solely on the basis of shape. Over the past three decades, there has been a great deal of research on shape analysis, focusing mostly on shape indexing, clustering, and classification. In this work, we introduce the new problem of finding shape discords, the most unusual s...
متن کاملUsing Locality Sensitive Hashing for Fast Computation of Correlational Manifold Learning based Robust Features
This paper considers the application of a random projections based hashing scheme, known as locality sensitive hashing (LSH), for fast computation of neighborhood graphs in manifold learning based feature space transformations in automatic speech recognition (ASR). Discriminative manifold learning based feature transformations have already been found to provide significant improvements in ASR p...
متن کاملRelocalization under Substantial Appearance Changes using Hashing
Localization under appearance changes is essential for robots during long-term operation. This paper investigates the problem of place recognition in environments that undergo dramatic visual changes. Our approach builds upon previous work on graph-based image sequence matching and extends it by incorporating a hashing-based image retrieval strategy in case of localization failures or the kidna...
متن کامل